Explicit incidence bounds over general finite fields
نویسندگان
چکیده
منابع مشابه
Classical Wavelet Transforms over Finite Fields
This article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. We present a concrete formulation for the Frobenius norm of the classical wavelet transforms over finite fields. It is shown that each vector defined over a finite field can be represented as...
متن کاملClassical wavelet systems over finite fields
This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...
متن کاملThe Explicit Construction of Irreducible Polynomials over Finite Fields
For a finite field GF(q) of odd prime power order q, and n > 1, we construct explicitly a sequence of monic irreducible reciprocal polynomials o f degree n2 m (m = 1, 2, 3 . . . . ) over GF(q). It is the analog for fields of odd order of constructions of Wiedemann and of Meyn over GF(2). We also deduce iterated presenn2** tations of GF(q ).
متن کاملExplicit factorizations of cyclotomic polynomials over finite fields
In this paper, we make an attempt to study the explicit factorization of 2.7-th cyclotomic polynomials over finite field Fq when q ≡ 1(mod 4) into a product of distinct monic irreducible polynomials, where q is a power of an odd prime. AMS Subject Classification: 11T06, 11T22, 12Y05
متن کاملExplicit formulas for monomial involutions over finite fields
Francis Castro, Carlos Corrada, Natalia Pacheco∗, Ivelisse Rubio, University of Puerto Rico, Ŕıo Piedras Permutations of finite fields have important applications in cryptography and coding theory. Involutions are permutations that are its own inverse and are of particular interest because the implementation used for coding can also be used for decoding. We present explicit formulas for all the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 2011
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa150-3-3